$(1-2u^2)$-constacyclic codes over $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$

نویسندگان

  • Hojjat Mostafanasab
  • Negin Karimi
چکیده

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$(1-2u^k)$-constacyclic codes over $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_+u^{3}\mathbb{F}_{p}+\dots+u^{k}\mathbb{F}_{p}$

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p+u^{3}\mathbb{F}_{p}+\cdots+u^{k}\mathbb{F}_{p}$ where $u^{k+1}=u$. We illustrate the generator polynomials and investigate the structural properties of these codes via decomposition theorem.

متن کامل

Trace Codes with Few Weights over $\mathbb{F}_p+u\mathbb{F}_p$

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring Fp+uFp. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. Then by using a linear Gray map, we obtain an infinite family of abelian codes with few weights over Fp. In particular, we obtain an infinite family of two-weight codes which me...

متن کامل

Negacyclic codes of odd length over the ring $\mathbb{F}_p[u, v]/\langle u^2, v^2, uv-vu\rangle$

We discuss the structure of negacyclic codes of odd length over the ring Fp[u, v]/〈u , v, uv − vu〉. We find the unique generating set, the rank and the minimum distance for these negacyclic codes.

متن کامل

$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes

Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...

متن کامل

Cyclic codes over the ring $\mathbb{F}_p[u,v] / \langle u^k,v^2,uv-vu\rangle$

Let p be a prime number. In this paper, we discuss the structures of cyclic codes over the ring F p [u, v]/u k , v 2 , uv − vu. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1506.07273  شماره 

صفحات  -

تاریخ انتشار 2015